A Logic of Knowledge Integrity

نویسنده

  • John Debenham
چکیده

In a unified knowledge representation, data, information and knowledge are all represented in a single formalism as “items”. A unified knowledge representation is extended here to include two types of fuzzy measures of knowledge integrity. These integrity measures define a graduated integrity region for data, information and knowledge. This fuzzy region contains knowledge of increasingly questionable integrity. A rule of inference is defined on the unified knowledge representation that preserves the validity of items. These inferences include the fuzzy measures of knowledge integrity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Integrity Constraints

We address the concept of a static integrity constraint as it arises in databases and Artificial Intelligence knowledge representation languages. Such constraints are meant to characterize the acceptable states of a knowledge base, and are used to enforce these legal states. We adopt the perspective that a knowledge base is a set of first order sentences, but argue, contrary to the prevailing v...

متن کامل

A Unifying Framework for ALP , CLP

This paper presents the TPCALP framework, a theorem-proving approach which aims to unify Abductive Logic Programming (ALP), Constraint Logic Programming (CLP) and Semantic Query Optimization (SQO). The framework combines the use of deenitions, as in ordinary logic programming, with the use of integrity constraints, as in ALP and SQO. The programmer can choose to represent knowledge in either fo...

متن کامل

Representing Incomplete Knowledge in Abductive Logic Programming

Recently, Gelfond and Lifschitz presented a formal language for representing incomplete knowledge on actions and states, and a sound translation from this language to extended logic programming. We present an alternative translation to abductive logic programming with integrity constraints and prove the sound-ness and completeness. In addition, we show how an abductive procedure can be used, no...

متن کامل

From Query Answering to Satissability in Nonmonotonic Logics

We propose a unifying view of negation as failure, integrity constraints, and epistemic queries in nonmonotonic reasoning. Specii-cally, we study the relationship between satis-ability and logical implication in nonmono-tonic logics, showing that, in many nonmono-tonic formalisms, it is possible and easy to reduce logical implication to satissability. This result not only allows for establishin...

متن کامل

Maintaining Integrity Constraints in Semantic Web

As an expressive knowledge representation language for Semantic Web, Web Ontology Language (OWL) plays an important role in areas like science and commerce. The problem of maintaining integrity constraints arises because OWL employs the Open World Assumption (OWA) as well as the Non-Unique Name Assumption (NUNA). These assumptions are typically suitable for representing knowledge distributed ac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002